Level sets of polynomials innreal variables
نویسندگان
چکیده
منابع مشابه
Difference Sets and Polynomials of Prime Variables
Abstract. Let ψ(x) be a polynomial with rational coefficients. Suppose that ψ has the positive leading coefficient and zero constant term. Let A be a set of positive integers with the positive upper density. Then there exist x, y ∈ A and a prime p such that x− y = ψ(p− 1). Furthermore, if P is a set of primes with the positive relative upper density, then there exist x, y ∈ P and a prime p such...
متن کاملZero Sets of Polynomials in Several Variables
Let k, n ∈ IN, where n is odd. We show that there is an integer N = N(k, n) such that for every n-homogeneous polynomial P : IRN → IR there exists a linear subspace X ↪→ IRN , dimX = k such that P |X ≡ 0. This quantitative estimate improves on previous work of Birch, et al, who studied this problem from an algebraic viewpoint. The topological method of proof presented here also allows us to obt...
متن کاملRuscheweyh Differential Operator Sets of Basic Sets of Polynomials of Several Complex Variables in Hyperelliptical Regions
The idea of the basic sets of polynomials of one complex variable appeared in 1930’s by Whittaker [33,34,35] who laid down the definition of a basic sets and their effectiveness. The study of the basic sets of polynomials of several complex variables was initiated by Mursi and Makar [25,26], Nassif [27], Kishka and others [13,14,17,18,19], where the representation in polycylindrical and hypersp...
متن کاملStable sets and polynomials
Several applications of methods from non-linear algebra to the stable set problem in graphs are surveyed. The most recent work sketched is joint with A. Schrijver and involves non-linear inequalities. These yield a procedure to generate facets of the stable set polytope. If a class of graphs has the property that all facets of the stable set polytope can be generated this way in a bounded numbe...
متن کاملZero sets of univariate polynomials
Let L be the zero set of a nonconstant monic polynomial with complex coe¢ cients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion of distance from a point to a subset, more general than the usual one, that allows us to measure distances to subsets like L. To verify the correctness of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1976
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1976.66.491